منابع مشابه
Computing Strongly Connected Components in Parallel on
The problem of decomposition of a directed graph into its strongly connected components is a fundamental graph problem inherently present in many scientific and commercial applications. In this paper we show how existing parallel algorithms can be reformulated in order to be accelerated by NVIDIA CUDA technology. In particular, we design a new CUDA-aware procedure for pivot selection and we red...
متن کاملOn Computing Connected Components of Line Segments
It is shown that given a set of n line segments their connected components can be computed in time O n log n A bound of o n for this problem would imply a similar bound for detecting for a given set of n points and n lines whether some point lies on some of the lines This problem known as Hopcroft s problem is believed to have a lower bound of n For the special case when the endpoints of each s...
متن کاملOn computing the $2$-vertex-connected components of directed graphs
In this paper we consider the problem of computing the 2-vertex-connected components (2-vccs) of directed graphs. We present two new algorithms for solving this problem. The first algorithm runs in O(mn) time, the second in O(nm) time. Furthermore, we show that the old algorithm of Erusalimskii and Svetlov runs inO(nm) time. In this paper, we investigate the relationship between 2-vccs and domi...
متن کاملHypercube Algorithms on Mesh Connected Multicomputers
A new methodology named CALMANT (CC-cube Algorithms on Meshes and Tori) for mapping a kind of algorithms that we call CC-cube algorithm onto multicomputers with hypercube, mesh, or torus interconnection topology is proposed. This methodology is suitable when the initial problem can be expressed as a set of processes that communicate through a hypercube topology (a CC-cube algorithm). There are ...
متن کاملDesign of Gracefully Degradable Hypercube-Connected Systems
We address the problem of modifying a hypercube computer by the addition of spare nodes and links to improve its fault tolerance, while maintaining a specified level of performance. The hypercube is modeled by a graph in which nodes represent processors and edges represent communication links. A new graphbased measure of performance degradation is introduced. This characterizes a fault-tolerant...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Supercomputing
سال: 1989
ISSN: 0920-8542,1573-0484
DOI: 10.1007/bf00127829